On elimination of redundant attributes from decision table

نویسندگان

  • Long Giang Nguyen
  • Hung Son Nguyen
چکیده

Most decision support systems based on rough set theory are related to the minimal reduct calculation problem, which is NP-hard. This paper investigates the problem of searching for the set of useful attributes that occur in at least one reduct. By compliment, this problem is equivalent to searching for the set of redundant attributes, i.e. the attributes that do not occur in any reducts of the given decision table. We show that the considered problem is equivalent to a Sperner system for relational data base system and prove that it can be solved in polynomial time. On the base of these theoretical results, we also propose some algorithms for elimination of redundant attributes in decision tables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rough Data Set Based Applications in Framing Decision Rules

Rough set theory is used for dealing with uncertainty in the hidden pattern of data. This paper outlines concepts of the rough set theory for lower and upper approximations, reduction of attributes and decision rules. It assumes that the information about the real world is given in the form of an information table which represents input data, gathered from any domain, such as, medicine, finance...

متن کامل

An Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables

In rough set theory, the number of all reducts for a given decision table can be exponential with respect to the number of attributes. This paper investigates the problem of determining the set of all reductive attributes which are present in at least one reduct of an incomplete decision table. We theoretically prove that this problem can be solved in polynomial time. This result shows that the...

متن کامل

Rule Generation based on Reduct and Core: A Rough Set Approach

Rough set theory has evolved as one of the most important technique used for feature selection as a result of contemporary developments in data mining. One of the cardinal uses of Rough set theory is its application for rule generation. More often attribute reduction poses a major challenge for developing the theory and applications of rough set. This paper proposes a unique mathematical approa...

متن کامل

Decision Rule Generation Using Data Mining Approach

This paper presents a novel data mining approach for fault diagnosis of turbine-generator units. The proposed rough set theory based approach generates the diagnosis rules from inconsistent and redundant information using genetic algorithm and process of rule generalization. In this paper, a fault diagnosis decision table is obtained from discretization of continuous symptom attributes in the d...

متن کامل

Discovering Maximal Generalized Decision Rules Through Horixontal and Vertical Data Reduction

We present a method to learn maximal generalized decision rules from databases by integrating discretization, generalization and rough set feature selection. Our method reduces the data horizontally and vertically. In the first phase, discretization and generalization are integrated and the numeric attributes are discretized into a few intervals. The primitive values of symbolic attributes are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012